Complexity of the Path Multi-Peg Tower of Hanoi
نویسندگان
چکیده
The Tower of Hanoi problem with h ≥ 4 pegs is long known to require a sub-exponential number of moves in order to transfer a pile of n disks from one peg to another. In this paper we discuss the Pathh variant, where the pegs are placed along a line, and disks can be moved from a peg to its nearest neighbor(s) only. Whereas in the simple variant there are h(h − 1)/2 bi-directional interconnections among pegs, here there are only h− 1 of them. Despite the significant reduction in the number of interconnections, the task of moving n disks between any two pegs is still shown to grow sub-exponentially as a function of the number of
منابع مشابه
Combinatorics of topmost discs of multi-peg Tower of Hanoi problem
Combinatorial properties of the multi-peg Tower of Hanoi problem on n discs and p pegs are studied. Top-maps are introduced as maps which reflect topmost discs of regular states. We study these maps from several points of view. We also count the number of edges in graphs of the multi-peg Tower of Hanoi problem and in this way obtain some combinatorial identities.
متن کاملOn the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem
It is proved that seven different approaches to the multi-peg Tower of Hanoi problem are all equivalent. Among them the classical approaches of Stewart and Frame from 1941 can be found.
متن کاملExponential vs. Subexponential Tower of Hanoi Variants
We deal here with Tower of Hanoi variants played on digraphs. A major source for such variants is achieved by adding pegs and/or restricting direct moves between certain pairs of pegs. It is natural to represent a variant of this kind by a directed graph whose vertices are the pegs, and an arc from one vertex to another indicates that it is allowed to move a disk from the former peg to the latt...
متن کاملAlgorithms and Bounds for Tower of Hanoi Problems on Graphs
The classic Tower of Hanoi puzzle was marketed by Edouard Lucas in 1883 under the name ”Tower of Hanoi” [31]. There, n disks are due to be moved from one peg to another, using an auxiliary peg while never placing a bigger disk above a smaller one. Its optimal solution is classic in Computer Science. In this thesis, we study a generalization of the original puzzle. The problem is generalized by ...
متن کاملExplorations in 4-peg Tower of Hanoi
Finding an optimal solution to the 4-peg version of the classic Tower of Hanoi problem has been an open problem since the 19th century, despite the existence of a presumed-optimal solution. We verify that the presumed-optimal Frame-Stewart algorithm for 4-peg Tower of Hanoi is indeed optimal, for up to 20 discs. We also develop a distributed Tower of Hanoi algorithm, and present 2D and 3D repre...
متن کامل